Metric transforms of finite spaces and connected graphs
نویسندگان
چکیده
منابع مشابه
Finite Metric Spaces and Partitions
For example, IR with the regular Euclidean distance is a metric space. It is usually of interest to consider the finite case, where X is an n-point set. Then, the function d can be specified by ( n 2 ) real numbers. Alternatively, one can think about (X,d) is a weighted complete graph, where we specify positive weights on the edges, and the resulting weights on the edges comply with the triangl...
متن کاملCompleting graphs to metric spaces
We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions. This is extended variant of an extended abstract accepted to Eurocomb 2017 which contains proofs of the main statements.
متن کاملExtended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولThe classification of finite connected hypermetric spaces
A finite distance space X , d d : X 2 --,7/ is hypermetric (of negative type) if axay d(x, y) < 0 for all integral sequences {axlx ~ X} that sum to 1 (sum to 0). X, d is connected if the set {(x, y)ld(x, y) = 1, x, y ~ X} is the edge set for a connected graph on X, and graphical if d is the path length distance for this graph. Then we prove Theorem 1. A connected space X, d has negative type if...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90094-4